Asymptotic Behavior of Excitable Cellular Automata
نویسندگان
چکیده
منابع مشابه
Asymptotic Behavior of Excitable Cellular Automata
This research was partially supported by research grants to each of the authors from the National Science Foundation We study two families of excitable cellular automata known as the Greenberg–Hastings model and the cyclic cellular automaton. Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, ...
متن کاملMemristive Excitable Cellular Automata
The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device’s terminals. We design a minimalistic model of a regular network of memristors using structurally-dynamic cellular automata. Each cell gets info about states of its closest neighbours via incoming links. A link can be one ’conductive’ or ’non-conductive’ states. States o...
متن کاملStochastic cellular automata modeling of excitable systems
Tamás Szakály, István Lagzi, Ferenc Izsák ∗and András Volford a Department of Physical Chemistry, Eötvös University, P.O. Box 32, Budapest H-1518, Hungary b Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands c Department of Applied Analysis and Computational Mathematics, Eötvös University, P.O. Box 120, Budapest H-1518, Hungary d Department ...
متن کاملAsymptotic Behavior and ratios of Complexity in Cellular Automata
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing neighbourhood range and number of symbols (or colours), and how different behaviour is distributed in the spaces of different cellular automata formalisms. ...
متن کاملOn the Asymptotic Behavior of Fuzzy Cellular Automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper we consider circular FCA; their asymptotic behavior has been observed through simulations and FCA have been empirically classified accordingly. No analytical study exists so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 1993
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.1993.10504277